Discrete Mathematics for Computer Science, Some Notes

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system "a la Prawitz". The rest of the material is more or less traditional but I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory. Disciplines Computer Sciences Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-07-23. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/700 Discrete Mathematics for Computer Science Some Notes Jean Gallier Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104, USA e-mail: [email protected] c © Jean Gallier Please, do not reproduce without permission of the author